menlo park
Generative Early Stage Ranking
Hong, Juhee, Liu, Meng, Wang, Shengzhi, Mao, Xiaoheng, Cheng, Huihui, Gao, Leon, Leung, Christopher, Zhou, Jin, Sekar, Chandra Mouli, Zhu, Zhao, Liu, Ruochen, Trieu, Tuan, Sun, Dawei, Kanjani, Jeet, Li, Rui, Qian, Jing, Cao, Xuan, Fan, Minjie, Gao, Mingze
Large-scale recommendations commonly adopt a multi-stage cascading ranking system paradigm to balance effectiveness and efficiency. Early Stage Ranking (ESR) systems utilize the "user-item decoupling" approach, where independently learned user and item representations are only combined at the final layer. While efficient, this design is limited in effectiveness, as it struggles to capture fine-grained user-item affinities and cross-signals. To address these, we propose the Generative Early Stage Ranking (GESR) paradigm, introducing the Mixture of Attention (MoA) module which leverages diverse attention mechanisms to bridge the effectiveness gap: the Hard Matching Attention (HMA) module encodes explicit cross-signals by computing raw match counts between user and item features; the Target-Aware Self Attention module generates target-aware user representations conditioned on the item, enabling more personalized learning; and the Cross Attention modules facilitate early and more enriched interactions between user-item features. MoA's specialized attention encodings are further refined in the final layer through a Multi-Logit Parameterized Gating (MLPG) module, which integrates the newly learned embeddings via gating and produces secondary logits that are fused with the primary logit. To address the efficiency and latency challenges, we have introduced a comprehensive suite of optimization techniques. These span from custom kernels that maximize the capabilities of the latest hardware to efficient serving solutions powered by caching mechanisms. The proposed GESR paradigm has shown substantial improvements in topline metrics, engagement, and consumption tasks, as validated by both offline and online experiments. To the best of our knowledge, this marks the first successful deployment of full target-aware attention sequence modeling within an ESR stage at such a scale.
- Europe > Austria > Vienna (0.14)
- North America > United States > California > San Mateo County > Menlo Park (0.06)
- North America > United States > New York > New York County > New York City (0.04)
- Asia > Myanmar > Tanintharyi Region > Dawei (0.04)
Transportability from Multiple Environments with Limited Experiments
Elias Bareinboim, Sanghack Lee, Vasant Honavar, Judea Pearl
This paper considers the problem of transferring experimental findings learned from multiple heterogeneous domains to a target domain, in which only limited experiments can be performed. We reduce questions of transportability from multiple domains and with limited scope to symbolic derivations in the causal calculus, thus extending the original setting of transportability introduced in [1], which assumes only one domain with full experimental information available. We further provide different graphical and algorithmic conditions for computing the transport formula in this setting, that is, a way of fusing the observational and experimental information scattered throughout different domains to synthesize a consistent estimate of the desired effects in the target domain. We also consider the issue of minimizing the variance of the produced estimand in order to increase power.
- North America > United States > Massachusetts > Middlesex County > Cambridge (0.14)
- North America > United States > California > San Mateo County > Menlo Park (0.05)
- Europe > United Kingdom > England > Cambridgeshire > Cambridge (0.04)
- (3 more...)
Transportability from Multiple Environments with Limited Experiments
Elias Bareinboim, Sanghack Lee, Vasant Honavar, Judea Pearl
This paper considers the problem of transferring experimental findings learned from multiple heterogeneous domains to a target domain, in which only limited experiments can be performed. We reduce questions of transportability from multiple domains and with limited scope to symbolic derivations in the causal calculus, thus extending the original setting of transportability introduced in [1], which assumes only one domain with full experimental information available. We further provide different graphical and algorithmic conditions for computing the transport formula in this setting, that is, a way of fusing the observational and experimental information scattered throughout different domains to synthesize a consistent estimate of the desired effects in the target domain. We also consider the issue of minimizing the variance of the produced estimand in order to increase power.
- North America > United States > Massachusetts > Middlesex County > Cambridge (0.14)
- North America > United States > California > San Mateo County > Menlo Park (0.05)
- Europe > United Kingdom > England > Cambridgeshire > Cambridge (0.04)
- (3 more...)
Zuckerberg hailed AI 'superintelligence'. Then his smart glasses failed on stage Matthew Cantor
Mark Zuckerberg wears artificial intelligence-powered glasses as he speaks at the Meta's Connect developers conference on 17 September in Menlo Park, California. Mark Zuckerberg wears artificial intelligence-powered glasses as he speaks at the Meta's Connect developers conference on 17 September in Menlo Park, California. As humanity inches closer to an AI apocalypse, a sliver of hope remains: the robots might not work. Such was the case last week, as Mark Zuckerberg attempted to demonstrate his company's new AI-enabled smart glasses. "I don't know what to tell you guys," Zuckerberg told a crowd of Meta enthusiasts as he tried, and failed, for roughly the fourth time to hold a video call with his colleague via the glasses.
- North America > United States > California > San Mateo County > Menlo Park (0.46)
- Oceania > Australia (0.05)
- North America > United States > California > San Francisco County > San Francisco (0.05)
- Europe > Ukraine (0.05)
- Information Technology > Services (1.00)
- Leisure & Entertainment > Sports (0.71)
RankGraph: Unified Heterogeneous Graph Learning for Cross-Domain Recommendation
Wu, Renzhi, Yang, Junjie, Chen, Li, Li, Hong, Yu, Li, Yan, Hong
Cross-domain recommendation systems face the challenge of integrating fine-grained user and item relationships across various product domains. To address this, we introduce RankGraph, a scalable graph learning framework designed to serve as a core component in recommendation foundation models (FMs). By constructing and leveraging graphs composed of heterogeneous nodes and edges across multiple products, RankGraph enables the integration of complex relationships between users, posts, ads, and other entities. Our framework employs a GPU-accelerated Graph Neural Network and contrastive learning, allowing for dynamic extraction of subgraphs such as item-item and user-user graphs to support similarity-based retrieval and real-time clustering. Furthermore, RankGraph integrates graph-based pretrained representations as contextual tokens into FM sequence models, enriching them with structured relational knowledge. RankGraph has demonstrated improvements in click (+0.92%) and conversion rates (+2.82%) in online A/B tests, showcasing its effectiveness in cross-domain recommendation scenarios.
- Europe > Czechia > Prague (0.06)
- North America > United States > New York > New York County > New York City (0.04)
- Europe > Greece (0.04)
Integrity and Junkiness Failure Handling for Embedding-based Retrieval: A Case Study in Social Network Search
Wang, Wenping, Guo, Yunxi, Shen, Chiyao, Ding, Shuai, Liao, Guangdeng, Fu, Hao, Prabhakar, Pramodh Karanth
Embedding based retrieval has seen its usage in a variety of search applications like e-commerce, social networking search etc. While the approach has demonstrated its efficacy in tasks like semantic matching and contextual search, it is plagued by the problem of uncontrollable relevance. In this paper, we conduct an analysis of embedding-based retrieval launched in early 2021 on our social network search engine, and define two main categories of failures introduced by it, integrity and junkiness. The former refers to issues such as hate speech and offensive content that can severely harm user experience, while the latter includes irrelevant results like fuzzy text matching or language mismatches. Efficient methods during model inference are further proposed to resolve the issue, including indexing treatments and targeted user cohort treatments, etc. Though being simple, we show the methods have good offline NDCG and online A/B tests metrics gain in practice. We analyze the reasons for the improvements, pointing out that our methods are only preliminary attempts to this important but challenging problem. We put forward potential future directions to explore.
- North America > United States > California > San Mateo County > Menlo Park (0.06)
- Asia > Taiwan > Taiwan Province > Taipei (0.06)
- North America > United States > New York > New York County > New York City (0.04)
- Asia > Myanmar > Tanintharyi Region > Dawei (0.04)
Automatic Measures for Evaluating Generative Design Methods for Architects
Yeh, Eric, Hitaj, Briland, Sadhu, Vidyasagar, Roy, Anirban, Nakabayashi, Takuma, Tsuji, Yoshito
The recent explosion of high-quality image-to-image methods has prompted interest in applying image-to-image methods towards artistic and design tasks. Of interest for architects is to use these methods to generate design proposals from conceptual sketches, usually hand-drawn sketches that are quickly developed and can embody a design intent. More specifically, instantiating a sketch into a visual that can be used to elicit client feedback is typically a time consuming task, and being able to speed up this iteration time is important. While the body of work in generative methods has been impressive, there has been a mismatch between the quality measures used to evaluate the outputs of these systems and the actual expectations of architects. In particular, most recent image-based works place an emphasis on realism of generated images. While important, this is one of several criteria architects look for. In this work, we describe the expectations architects have for design proposals from conceptual sketches, and identify corresponding automated metrics from the literature. We then evaluate several image-to-image generative methods that may address these criteria and examine their performance across these metrics. From these results, we identify certain challenges with hand-drawn conceptual sketches and describe possible future avenues of investigation to address them.
- Asia > Japan > Honshū > Kantō > Tokyo Metropolis Prefecture > Tokyo (0.15)
- North America > United States > California > San Mateo County > Menlo Park (0.05)
- North America > United States > New York > New York County > New York City (0.04)
Flashlight: Enabling Innovation in Tools for Machine Learning
Kahn, Jacob, Pratap, Vineel, Likhomanenko, Tatiana, Xu, Qiantong, Hannun, Awni, Cai, Jeff, Tomasello, Paden, Lee, Ann, Grave, Edouard, Avidov, Gilad, Steiner, Benoit, Liptchinsky, Vitaliy, Synnaeve, Gabriel, Collobert, Ronan
As the computational requirements for machine learning systems and the size and complexity of machine learning frameworks increases, essential framework innovation has become challenging. While computational needs have driven recent compiler, networking, and hardware advancements, utilization of those advancements by machine learning tools is occurring at a slower pace. This is in part due to the difficulties involved in prototyping new computational paradigms with existing frameworks. Large frameworks prioritize machine learning researchers and practitioners as end users and pay comparatively little attention to systems researchers who can push frameworks forward -- we argue that both are equally important stakeholders. We introduce Flashlight, an open-source library built to spur innovation in machine learning tools and systems by prioritizing open, modular, customizable internals and state-of-the-art, research-ready models and training setups across a variety of domains. Flashlight allows systems researchers to rapidly prototype and experiment with novel ideas in machine learning computation and has low overhead, competing with and often outperforming other popular machine learning frameworks. We see Flashlight as a tool enabling research that can benefit widely used libraries downstream and bring machine learning and systems researchers closer together.
- North America > United States > California > San Mateo County > Menlo Park (0.05)
- North America > United States > New York > New York County > New York City (0.04)
- Asia > Japan > Honshū > Tōhoku > Fukushima Prefecture > Fukushima (0.04)
- (4 more...)
Deepcell Appoints New Head of Bioinformatics to Support Rapid Company Growth
Deepcell, a life science company pioneering AI-powered cell classification and isolation for cell biology and translational research, today announced the appointment of Kevin Jacobs as the Vice President of Bioinformatics. Jacobs will be responsible for the company's bioinformatics strategy, implementation and its integration with other areas and into the company's offerings. This appointment is the latest addition to Deepcell's rapidly expanding team of scientists, engineers and computer science experts. Deepcell had acquired $20 million in Series A funding last year. Currently, Deepcell is helping to advance precision medicine by combining advances in AI, cell classification and capture, and single-cell analysis to deliver novel insights through an unprecedented view of cell biology.
- Pacific Ocean > North Pacific Ocean > San Francisco Bay (0.06)
- North America > United States > California > San Francisco County > San Francisco (0.06)
- Health & Medicine (0.99)
- Banking & Finance > Capital Markets (0.56)